Bellman–Ford algorithm for solving shortest path problem of a network under picture fuzzy environment

Abstract An elongation of the novel intuitionistic fuzzy set is a picture theory. The demonstration this has been used to deal with abstinence criteria in decision-making problem. uncertainty nature occurs sometimes real-world problems and amidst them, prominent one shortest path problem (SPP) solving. In last few years, best algorithms on network for finding SPP Bellman–Ford. Due process, it becomes difficult decision-makers communicating their point view judgment certainty. We conceive contribution via Bellman's algorithm (BA) trapezoidal numbers (TPFNs). introduce new stand between each pair nodes. A TPFN considered length all edges. numerical example validation presented also proposed. There relative research existing techniques showing benefits algorithm.